Hiding personal information reveals the worst
نویسندگان
چکیده
منابع مشابه
Hiding personal information reveals the worst.
Seven experiments explore people's decisions to share or withhold personal information, and the wisdom of such decisions. When people choose not to reveal information--to be "hiders"--they are judged negatively by others (experiment 1). These negative judgments emerge when hiding is volitional (experiments 2A and 2B) and are driven by decreases in trustworthiness engendered by decisions to hide...
متن کاملInformation Hiding in Parallel Programs Information Hiding in Parallel Programs
ions that together allow these decisions to be isolated and hidden. Virtual topolo-gies, virtual channels, and lightweight processes provide mechanisms for isolating mapping,communication, and scheduling decisions, while port arrays allow these techniques to beapplied to program components that must execute on many processors.In addition to describing the abstractions, we have s...
متن کاملWorst-case additive attack against quantization-based data-hiding methods
The main goal of this study consists in the development of the worst case additive attack (WCAA) for quantization-based methods using as design criteria the bit error rate probability and the maximum achievable rate of reliable communications. Our analysis is focused on the practical scheme known as a distortion compensation dither modulation (DC-DM). From the mathematical point of view, the pr...
متن کاملInformation Hiding Systems
The art and science of writing hidden messages in such a way that no one apart from the intended recipient knows of the existence of the message is Steganography. This differs from cryptography, the art of secret writing, which is intended to make a message unreadable by a third party by encrypting the data. If a piece of text looks suspicious , it is easy to suspect that someone wants to hide ...
متن کاملInformation Hiding by Coverings *
We propose a formal model for embedding information in black-white images and prove the equivalence between existence of embedding schemes and covering codes. An asymptoticly tight bound on the performance of embedding schemes is given. We construct efficient embedding schemes via known coverings. In particular, one of those schemes allows to embed up to log 2 (n + 1) bits in coverwords of n bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2016
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1516868113